An ElGamal-Like Cryptosystem for Enciphering Large Messages
نویسندگان
چکیده
(Only in case the thesis is approved) The Thesis at instance is hereby approved as a creditable study of an engineering subject carried out and presented in a manner satisfactory to warrant its acceptance as a prerequisite to the degree for which it has been submitted. It is understood that by this approval the undersigned does not necessarily endorse or approve any statement made, opinion expressed or conclusion drawn therein, but approve this thesis for the purpose for which it is submitted.
منابع مشابه
Cryptanalysis of an ElGamal-Like Cryptosystem for Enciphering Large Messages
In 2002, Hwang et al. propose an asymmetric cryptosystem in which a large message is broken into smaller plaintexts which are then encrypted efficiently. They claim that based on the assumption of the intractability of the discrete logarithm problem, their cryptosystem is secure in the sense that even knowing some pairs of plaintext-ciphertext does not allow an intruder to acquire other plainte...
متن کاملImage Encryption and Decryption in A Modification of ElGamal Cryptosystem in MATLAB
The need of exchanging messages and images secretly over unsecure networks promoted the creation of cryptosystems to enable receivers to interpret the exchanged information. In this paper, a particular public key cryptosystem called the ElGamal Cryptosystem is presented considered with the help MATLAB Program to be used over Images. Since the ElGamal cryptosystem over a primitive root of a larg...
متن کاملThe Discrete Logarithm problem in the ElGamal cryptosystem over the abelian group U(n) Where n= p^m, or 2p^m
This study is mainly about the discrete logarithm problem in the ElGamal cryptosystem over the abelian group U(n) where n is one of the following forms p, or 2p where p is an odd large prime and m is a positive integer. It is another good way to deal with the ElGamal Cryptosystem using that abelian group U(n)={x: x is a positive integer such that x<n and gcd(n,x)=1} in the setting of the discre...
متن کاملImplementation of the RSA Public - Key Cryptosystem
The history of secret messages, cryptosystems, codes and codecracking is as old as the history of man. In this article, we will deal with the cryptosystem proposed by Rivest, Shamir and Adleman in 1977, see [3]. It has two characteristics which distinguish it from most other encryption methods: The usage of Number Theory and the fact that the process of deciphering is not just opposite to the o...
متن کاملSecure ElGamal-Type Cryptosystems Without Message Encoding
ElGamal cryptosystem is one of the oldest public-key cryptosystems. It is known to be semantically secure for arbitrary messages in the random oracle model under the decisional Diffie-Hellman assumption. Semantic security also holds in the standard model when messages are encoded as elements in the group for which the decisional Diffie-Hellman assumption is defined. This paper introduces a sett...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Knowl. Data Eng.
دوره 14 شماره
صفحات -
تاریخ انتشار 2002